Strong approximations for Markovian service networks
نویسندگان
چکیده
Avi Mandelbaum , William A. Massey b and Martin I. Reiman c Davidson Faculty of Industrial Engineering and Management, Technion Institute, Haifa 32000, Israel E-mail: [email protected] b Bell Laboratories, Lucent Technologies, Office 2C-320, Murray Hill, NJ 07974, USA E-mail: [email protected] c Bell Laboratories, Lucent Technologies, Office 2C-315, Murray Hill, NJ 07974, USA E-mail: [email protected]
منابع مشابه
Synchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control
In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...
متن کاملStrong Approximations
In real stochastic systems, the arrival and service processes may not be renewal processes. For example, in many telecommunication systems such as internet traffic where data traffic is bursty, the sequence of inter-arrival times and service times are often correlated and dependent. One way to model this non-renewal behavior is to use Markovian Arrival Processes (MAP’s) and Markovian Service Pr...
متن کاملApproximate Analysis of Queueing Networks with Markovian Arrival Processes and Phase Type Service Times
Open queueing networks with Markovian arrival processes and phase type service times are considered. A technique is proposed for the speciication of the models. Using such a speciication, a Markov chain can be generated automatically. Furthermore, this description can be used immediately for simulation. An approximate disaggregation{aggregation technique for nite state Markov chains is applied....
متن کاملAnalytic Computation of End-to-end Delays in Queueing Networks with Batch Markovian Arrival Processes and Phase-type Service Times
This paper poposes an analytic approach to compute end-to-end delays in queueing networks composed of BMAP/PH/1 queues. The approximations for the first two moments of the end-to-end delays are based on corresponding moments for the delays at each node in the network. In a traffic-based decomposition of queueing networks, different techniques for the departure process approximation, including t...
متن کاملDiffusion Approximations for a Markovian Multi-Class Service System with “Guaranteed” and “Best-Effort” Service Levels
This paper considers a Markovian model of a service system motivated by communication and information services. The system has finite processing capacity and offers multiple grades of service. The highest priority users receive a “guaranteed” processing rate, while lower priority users share residual capacity according to their priority level and therefore may experience service degradation; he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 30 شماره
صفحات -
تاریخ انتشار 1998